Heavy Traac Approximations for a System of Innnite Servers with Load Balancing
نویسنده
چکیده
We consider an exponential queueing system with multiple stations, each of which has an innnite number of servers and a dedicated arrival stream of jobs. In addition, there is an arrival stream of jobs that choose a station based on the state of the system. In this paper we describe two heavy traac approximations for the stationary joint probability mass function of the number of busy servers at each station. One of the approximations involves state-space collapse and is accurate for large traac loads. The state-space in the second approximation does not collapse. It provides an accurate estimate of the stationary behavior of the system over a wide range of traac loads.
منابع مشابه
Load Balancing Approaches for Web Servers: A Survey of Recent Trends
Numerous works has been done for load balancing of web servers in grid environment. Reason behinds popularity of grid environment is to allow accessing distributed resources which are located at remote locations. For effective utilization, load must be balanced among all resources. Importance of load balancing is discussed by distinguishing the system between without load balancing and with loa...
متن کاملA Heavy Traffic Limit Theorem for Workload Processes with Heavy Tailed Service Requirements
A system with heavy tailed service requirements under heavy load having a single server, has an equilibrium waiting time distribution which is approximated by the Mittag{Leeer distribution. This fact is understood by a direct analysis of the weak convergence of a sequence of negative drift random walks with heavy right tail and the associated all time maxima of these random walks. This approach...
متن کاملDynamic Scheduling of a System with Two Parallel Servers in Heavy Traac with Complete Resource Pooling: Asymptotic Optimality of a Continuous Review Threshold Policy 1
rights reserved. Personal scientiic non-commercial use only for individuals with permission from the authors ([email protected]). Abstract This paper concerns a dynamic scheduling problem for a queueing system that has two streams of arrivals to innnite capacity buuers and two (non-identical) servers working in parallel. One server can only process jobs from one buuer, whereas the other se...
متن کاملDynamic Scheduling of a System with Two Parallel Servers in Heavy Traac with Resource Pooling: Asymptotic Optimality of a Threshold Policy 1
This paper concerns a dynamic scheduling problem for a queueing system that has two streams of arrivals to innnite capacity buuers and two (non-identical) servers working in parallel. One server can only process jobs from one buuer, whereas the other server can process jobs from either buuer. The service time distribution may depend on the buuer being served and the server providing the service...
متن کاملA Nonstationary Offered - Load Modelfor Packet
Motivated by the desire to appropriately account for complex features of network traac revealed in traac measurements, such as heavy-tail probability distributions, long-range dependence , self similarity and nonstationarity, we propose a nonstationary ooered-load model. Connections of multiple types arrive according to independent nonhomogeneous Poisson processes , and general bandwidth stocha...
متن کامل